By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 18, Issue 1, pp. 1-378

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints

Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, and Shuzhong Zhang

pp. 1-28

BibTeX  Abstract Full Text:  PDF

A Convergent Incremental Gradient Method with a Constant Step Size

Doron Blatt, Alfred O. Hero, and Hillel Gauchman

pp. 29-51

BibTeX  Abstract Full Text:  PDF

On the Relationship between the Convergence Rates of Iterative and Continuous Processes

Raphael Hauser and Jelena Nedic

pp. 52-64

BibTeX  Abstract Full Text:  PDF

An Interior-Point Trust-Region Algorithm for General Symmetric Cone Programming

Ye Lu and Ya-Xiang Yuan

pp. 65-86

BibTeX  Abstract Full Text:  PDF

Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

Javier Peña, Juan Vera, and Luis F. Zuluaga

pp. 87-105

BibTeX  Abstract Full Text:  PDF

Approximate Gauss–Newton Methods for Nonlinear Least Squares Problems

S. Gratton, A. S. Lawless, and N. K. Nichols

pp. 106-132

BibTeX  Abstract Full Text:  PDF

Representation of Sets of Lattice Points

Raymond Hemmecke and Robert Weismantel

pp. 133-137

BibTeX  Abstract Full Text:  PDF

Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances

Xiaoling Hou and András Prékopa

pp. 138-155

BibTeX  Abstract Full Text:  PDF

Second-Order Cone Programming Relaxation of Sensor Network Localization

Paul Tseng

pp. 156-185

BibTeX  Abstract Full Text:  PDF

Approximating K-means-type Clustering via Semidefinite Programming

Jiming Peng and Yu Wei

pp. 186-205

BibTeX  Abstract Full Text:  PDF

Decomposition-Based Interior Point Methods for Two-Stage Stochastic Semidefinite Programming

Sanjay Mehrotra and M. Gökhan Özevin

pp. 206-222

BibTeX  Abstract Full Text:  PDF

A Copositive Programming Approach to Graph Partitioning

Janez Povh and Franz Rendl

pp. 223-241

BibTeX  Abstract Full Text:  PDF

A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems

Mikhail V. Solodov

pp. 242-259

BibTeX  Abstract Full Text:  PDF

A Unilaterally Constrained Quadratic Minimization with Adaptive Finite Elements

Kunibert G. Siebert and Andreas Veeser

pp. 260-289

BibTeX  Abstract Full Text:  PDF

A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems

Gerard van der Laan, Dolf Talman, and Zaifu Yang

pp. 290-308

BibTeX  Abstract Full Text:  PDF

Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces

Hui Hu

pp. 309-321

BibTeX  Abstract Full Text:  PDF

Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints

Darinka Dentcheva, René Henrion, and Andrzej Ruszczyński

pp. 322-337

BibTeX  Abstract Full Text:  PDF

Efficient Line Search Methods for Convex Functions

Edgar den Boef and Dick den Hertog

pp. 338-363

BibTeX  Abstract Full Text:  PDF

New Korkin–Zolotarev Inequalities

R. A. Pendavingh and S. H. M. van Zwam

pp. 364-378

BibTeX  Abstract Full Text:  PDF